Preserving Minority Structures in Graph Sampling
نویسندگان
چکیده
Sampling is a widely used graph reduction technique to accelerate computations and simplify visualizations. By comprehensively analyzing the literature on sampling, we assume that existing algorithms cannot effectively preserve minority structures are rare small in but very important analysis. In this work, initially conduct pilot user study investigate representative most appealing human viewers. We then perform an experimental evaluate performance of sampling regarding structure preservation. Results confirm our assumption suggest key points for designing new approach named mino-centric (MCGS). approach, triangle-based algorithm cut-point-based proposed efficiently identify structures. A set importance assessment criteria designed guide preservation Three optimization objectives introduced into greedy strategy balance between majority suppress generation series experiments case studies conducted effectiveness MCGS.
منابع مشابه
Mining Preserving Structures in a Graph Sequence
In the recent research of data mining, frequent structures in a sequence of graphs have been studied intensively, and one of the main concern is changing structures along a sequence of graphs that can capture dynamic properties of data. On the contrary, we newly focus on “preserving structures” in a graph sequence that satisfy a given property for a certain period, and mining such structures is...
متن کاملStructure-preserving desynchronization of minority games
Perfect synchronicity in N-player games is a useful theoretical dream, but communication delays are inevitable and may result in asynchronous interactions. Some systems such as financial markets are asynchronous by design, and yet most theoretical models assume perfectly synchronized actions. We propose a general method to transform standard models of adaptive agents into asynchronous systems w...
متن کاملCommon fixed point results for graph preserving mappings in parametric $N_b$-metric spaces
In this paper, we discuss the existence and uniqueness of points of coincidence and common fixed points for a pair of graph preserving mappings in parametric $N_b$-metric spaces. As some consequences of this study, we obtain several important results in parametric $b$-metric spaces, parametric $S$-metric spaces and parametric $A$-metric spaces. Finally, we provide some illustrative examples to ...
متن کاملDistance-Preserving Graph Contractions
Compression and sparsification algorithms are frequently applied in a preprocessing step before analyzing or optimizing large networks/graphs. In this paper we propose and study a new framework for contracting edges of a graph (merging vertices into super-vertices) with the goal of preserving pairwise distances as accurately as possible. Formally, given an edge-weighted graph, the contraction s...
متن کاملTopology Preserving Graph Matching
We describe an algorithm for graph matching which preserves global topological structure using an homology preserving graph matching. We show that for simplicial homology, graph matching is equivalent to finding an optimal simplicial chain map, which can be posed as a linear program satisfying boundary commutativity, simplex face intersection and assignment constraints. The homology preserving ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Visualization and Computer Graphics
سال: 2021
ISSN: ['1077-2626', '2160-9306', '1941-0506']
DOI: https://doi.org/10.1109/tvcg.2020.3030428